#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5 + 5;
int n, a[N], f, d[N], ans;
int main() {
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    sort(a + 1, a + n + 1);
    f = 1;
    for (int i = 2; i <= n; i++) {
        if (f < i && a[i] > a[f]) {
            ans++;
            d[f] = 1;
        }
        while (f <= n && d[f]) f++;
        //cout << ans << ' ' << f << endl;
    }
    cout << n - ans << endl;
    return 0;
}
//5
//1 2 3 1 2
